Optimistic Lookup of Whole NFS Paths in a Single Operation
نویسنده
چکیده
VFS lookup code examines and translates path names one component at a time, checking for special cases such as mount points and symlinks. VFS calls the NFS lookup operation as necessary. NFS employs caching to reduce the number of lookup operations that go to the server. However , when part or all of a path is not cached, NFS lookup operations go back to the server. Although NFS's caching is eeective, component-by-component translation of an uncached path is in-eecient, enough so that lookup is typically the operation most commonly processed by servers. We study the eeect of augmenting the VFS lookup algorithm and the NFS protocol so that a client can ask a server to translate an entire path in a single operation. The preconditions for a successful request are usually but not always satissed, so the algorithm is optimistic. This small change can deliver substantial improvements in client latency and server load.
منابع مشابه
A Caching NFS Client for Linux
The Linux NFS client suffers from poor performance. As Linux has become more popular, its primitive NFS client implementation has outgrown its usefulness. We describe numerous enhancements to the Linux NFS client that improve performance. Specifically, we discuss better lookup and attribute caching, asynchronous writing of data, and local disk caching of data file reads. We describe our impleme...
متن کاملA Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings
In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کامل